Conjectures on optimal nested generalized group testing algorithm
نویسندگان
چکیده
منابع مشابه
An Almost Optimal Algorithm for Generalized Threshold Group Testing with Inhibitors
Group testing is a search paradigm where one is given a population S of n elements and an P is a subset of S defective elements and the goal is to determine P by performing tests on subsets of S. In classical group testing a test on a subset Q is a subset of S receives a YES response if [formula: see text] ≥ 1, and a NO response otherwise. In group testing with inhibitors (GTI), identifying the...
متن کاملGeneralized Framework for Selectors with Applications in Optimal Group Testing
Group Testing refers to the situation in which one is given a set of objects O, an unknown subset P O, and the task is to determine P by asking queries of the type \does P intersect Q?", where Q is a subset of O. Group testing is a basic search paradigm that occurs in a variety of situations such as quality control in product testing, searching in storage systems, multiple access communications...
متن کاملOn a Parity Based Group Testing Algorithm
In traditional Combinatorial Group Testing the problem is to identify up to d defective items from a set of n items on the basis of group tests. In this paper we describe a variant of the group testing problem above, which we call parity group testing. The problem is to identify up to d defective items from a set of n items as in the classical group test problem. The main difference is that we ...
متن کاملNotes on the Generalized Ramanujan Conjectures
Ramanujan’s original conjecture is concerned with the estimation of Fourier coefficients of the weight 12 holomorphic cusp form ∆ for SL(2,Z) on the upper half plane H. The conjecture may be reformulated in terms of the size of the eigenvalues of the corresponding Hecke operators or equivalently in terms of the local representations which are components of the automorphic representation associa...
متن کاملVerifying Two Conjectures on Generalized Elite Primes
A prime number p is called b-elite if only finitely many generalized Fermat numbers Fb,n = b 2 + 1 are quadratic residues modulo p. Let p be a prime. Write p − 1 = 2h with r ≥ 0 and h odd. Define the length of the b-Fermat period of p to be the minimal natural number L such that Fb,r+L ≡ Fb,r (mod p). Recently Müller and Reinhart derived three conjectures on b-elite primes, two of them being th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Stochastic Models in Business and Industry
سال: 2020
ISSN: 1524-1904,1526-4025
DOI: 10.1002/asmb.2555